Stability and strategy-proofness for matching with constraints: A necessary and sufficient condition
نویسندگان
چکیده
منابع مشابه
A necessary and sufficient condition for stable matching rules to be strategy-proof
Incompatibility between stability and strategy-proofness is well-known in the two-sided matching theory and this has been problems especially in designing matching rules. One possible resolution to such an impossibility result is to focus on the restricted preference domain. This paper analyzes the scope for the situation where the sets of admissible preferences for one side of the market are r...
متن کاملNecessary and Sufficient Condition for Stability of Generalized Expectation Value
Given a probability distribution {pi}i 1,2,...,W , that is, 0 ≤ pi ≤ 1 i 1, 2, . . . ,W and ∑W i 1 pi 1, the ordinary expectation value of a quantity Q of a system under consideration is defined by ∑W i 1 piQi, where W is the total number of accessible states and is enormously large in statistical mechanics, typically being 210 23 . In the field of generalized statistical mechanics for complex ...
متن کاملA Necessary and Sufficient Condition for Transcendency
As has been known for many years (see, e.g., K. Mahler, /. Reine Angew. Math., v. 166, 1932, pp. 118-150), a real or complex number f is transcendental if and only if the following condition is satisfied. To every positive number co there exists a positive integer n and an infinite sequence of distinct polynomials {p,(z)} = {pr + pr z + • • • + p z } at most of 0 1 n degree n with integral coef...
متن کاملA Necessary and Sufficient Condition for Peace∗
This paper examines the possibility for two contestants to agree on a peace settlement thereby avoiding a contest, in which each would exert a costly effort given the posterior distributions inferred from the negotiation. I find a necessary and sufficient condition of the prior distributions for there to exist a negotiation mechanism that admits a peace-ensuring perfect Bayesian equilibrium. Th...
متن کاملNecessary and Sufficient Stability Condition of Discrete State Delay Systems
Abstract: A new method to solve a Lyapunov equation for a discrete delay system is proposed. Using this method, a Lyapunov equation can be solved from a simple linear equation and N -th power of a constant matrix, where N is the state delay. Combining a Lyapunov equation and frequency domain stability, a new stability condition is proposed for a discrete state delay system whose state delay is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Economics
سال: 2018
ISSN: 1933-6837
DOI: 10.3982/te2717